Construction of Polar Codes With Sublinear Complexity
نویسندگان
چکیده
منابع مشابه
An Efficient Construction and Low Complexity Collaborative Decoding of Reed-Solomon Concatenated with Modified Polar Codes
Polar codes are the first explicit code sequences that provably achieve capacity for discrete memory-less channels. However, their performance with successive cancellation (SC) decoding is unimpressive at practical block-lengths. In this paper, we propose a scheme of concatenating Reed-Solomon (RS) with modified polar codes to improve the performance of SC. Firstly, short repetition block codes...
متن کاملProperties and Construction of Polar Codes
Recently, Arıkan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel. In the thesis, we show that decoding algorithm of polar codes, called successive cancellation decoding, can be regarded as belief propagation decoding, which has been used for decoding of low-density parity-...
متن کاملconstruction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولConstruction of Capacity-Achieving Lattice Codes: Polar Lattices
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity 1 2 log(1+ SNR) of the additive white Gaussian-noise (AWGN) channel for any signal-to-noise ratio (SNR). Our construction follows the multilevel approach of Forney et al., where on each level we construct a capacityachieving polar code. The component polar codes are nat...
متن کاملLow Complexity List Decoding for Polar Codes with Multiple CRC Codes
Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2889667